全文获取类型
收费全文 | 195篇 |
免费 | 33篇 |
国内免费 | 5篇 |
出版年
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 9篇 |
2012年 | 13篇 |
2011年 | 7篇 |
2010年 | 13篇 |
2009年 | 16篇 |
2008年 | 16篇 |
2007年 | 19篇 |
2006年 | 16篇 |
2005年 | 10篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有233条查询结果,搜索用时 15 毫秒
91.
环境问题已经成为一大社会问题,环境新闻成为媒体和公众关注的焦点。国内环境新闻作为一个新兴的报道题材,已迅速闯进主要新闻传媒的主阵地,并逐渐成为与时政新闻、经济新闻、科技新闻等并驾齐驱的报道领域,成为各家传媒和记者争相采访报道的重要内容。本文从环境新闻的概念与产生入手,分析其在中国的发展。 相似文献
92.
针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪. 相似文献
93.
针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mn)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。 相似文献
94.
There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if Xi = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015 相似文献
95.
This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015 相似文献
96.
《兵团教育学院学报》作为主要反映本校教学、科研及兵团中小学教育教学成果为内容的综合性学术理论刊物,在推动学校的学科建设、学术研究、培养人才及促进兵团各级各类教育发展等方面发挥着重大作用。本文对学报2009-2013刊登的学术论文进行了计量分析,厘清学报的发展脉络,同时也发现了学报中存在的一些问题如:特色栏目不突出,高质量稿源匮乏,学报宣传力度不大等并提出相应解决措施。 相似文献
97.
研究一类二阶常微分方程组两点边值问题,利用Krasnoselskii’s不动点定理,得到当f和g满足超线性或次线性时边值问题一个正解存在的充分条件. 相似文献
98.
构造迭代算法研究了矩阵方程[AXB,GXH] = [C,D] ,证明了该算法可经有限步得到方程的对称最小二乘解及其最佳逼近,并给出了相关性质.最后,通过数值例子表明该算法是有效的. 相似文献
99.
Elsie Sterbin Gottlieb 《海军后勤学研究》2002,49(7):666-685
This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034 相似文献
100.
The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016 相似文献